On Variable Ordering and Decomposition Type Choice in OKFDDs

| We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree-like circuit we develope diierent heuristics to nd good variable orderings and decomposition types for OKFDDs representing two-level and multi-level circuits, respectively. Experimental results are presented to show the eeciency of our approaches.